<title>数列操作b</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span> <span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#define MAXN 100005</span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-p">];</span>
<span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-o">*</span><span class="pl-mi">4</span><span class="pl-p">];</span>
<span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">lazy</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-o">*</span><span class="pl-mi">4</span><span class="pl-p">];</span>
<span class="pl-kt">int</span> <span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">m</span><span class="pl-p">,</span><span class="pl-n">a</span><span class="pl-p">,</span><span class="pl-n">b</span><span class="pl-p">;</span>
<span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">c</span><span class="pl-p">;</span>
<span class="pl-kt">void</span> <span class="pl-nf">build</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">root</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">l</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">r</span><span class="pl-p">){</span>
    <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">l</span><span class="pl-o">==</span><span class="pl-n">r</span><span class="pl-p">){</span>
        <span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">root</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">l</span><span class="pl-p">];</span>
        <span class="pl-k">return</span><span class="pl-p">;</span>
    <span class="pl-p">}</span><span class="pl-k">else</span> <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">l</span><span class="pl-o">&gt;</span><span class="pl-n">r</span><span class="pl-p">)</span><span class="pl-k">return</span><span class="pl-p">;</span>
    <span class="pl-kt">int</span> <span class="pl-n">mid</span><span class="pl-o">=</span><span class="pl-p">(</span><span class="pl-n">l</span><span class="pl-o">+</span><span class="pl-n">r</span><span class="pl-p">)</span><span class="pl-o">&gt;&gt;</span><span class="pl-mi">1</span><span class="pl-p">;</span>
    <span class="pl-n">build</span><span class="pl-p">(</span><span class="pl-n">root</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">l</span><span class="pl-p">,</span><span class="pl-n">mid</span><span class="pl-p">);</span>
    <span class="pl-n">build</span><span class="pl-p">(</span><span class="pl-n">root</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-o">|</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">mid</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">r</span><span class="pl-p">);</span>
    <span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">root</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">root</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">root</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-o">|</span><span class="pl-mi">1</span><span class="pl-p">];</span>
<span class="pl-p">}</span>
<span class="pl-kt">void</span> <span class="pl-nf">update</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">root</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">l</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">r</span><span class="pl-p">,</span><span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">w</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">root</span><span class="pl-p">]</span><span class="pl-o">+=</span><span class="pl-p">(</span><span class="pl-n">r</span><span class="pl-o">-</span><span class="pl-n">l</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">)</span><span class="pl-o">*</span><span class="pl-n">w</span><span class="pl-p">;</span>
    <span class="pl-n">lazy</span><span class="pl-p">[</span><span class="pl-n">root</span><span class="pl-p">]</span><span class="pl-o">+=</span><span class="pl-n">w</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kt">void</span> <span class="pl-nf">down</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">root</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">l</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">r</span><span class="pl-p">){</span>
    <span class="pl-kt">int</span> <span class="pl-n">mid</span><span class="pl-o">=</span><span class="pl-p">(</span><span class="pl-n">l</span><span class="pl-o">+</span><span class="pl-n">r</span><span class="pl-p">)</span><span class="pl-o">&gt;&gt;</span><span class="pl-mi">1</span><span class="pl-p">;</span>
    <span class="pl-n">update</span><span class="pl-p">(</span><span class="pl-n">root</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">l</span><span class="pl-p">,</span><span class="pl-n">mid</span><span class="pl-p">,</span><span class="pl-n">lazy</span><span class="pl-p">[</span><span class="pl-n">root</span><span class="pl-p">]);</span>
    <span class="pl-n">update</span><span class="pl-p">(</span><span class="pl-n">root</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-o">|</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">mid</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">r</span><span class="pl-p">,</span><span class="pl-n">lazy</span><span class="pl-p">[</span><span class="pl-n">root</span><span class="pl-p">]);</span>
    <span class="pl-n">lazy</span><span class="pl-p">[</span><span class="pl-n">root</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kt">void</span> <span class="pl-nf">add</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">root</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">l</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">r</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">s</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">t</span><span class="pl-p">,</span><span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">w</span><span class="pl-p">){</span>
    <span class="pl-c1">//if(l&gt;s)return;</span>
    <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">s</span><span class="pl-o">&lt;=</span><span class="pl-n">l</span><span class="pl-o">&amp;&amp;</span> <span class="pl-n">t</span><span class="pl-o">&gt;=</span><span class="pl-n">r</span><span class="pl-p">){</span>
        <span class="pl-n">update</span><span class="pl-p">(</span><span class="pl-n">root</span><span class="pl-p">,</span><span class="pl-n">l</span><span class="pl-p">,</span><span class="pl-n">r</span><span class="pl-p">,</span><span class="pl-n">w</span><span class="pl-p">);</span>
        <span class="pl-k">return</span><span class="pl-p">;</span>
    <span class="pl-p">}</span>
    <span class="pl-kt">int</span> <span class="pl-n">mid</span><span class="pl-o">=</span><span class="pl-p">(</span><span class="pl-n">r</span><span class="pl-o">+</span><span class="pl-n">l</span><span class="pl-p">)</span><span class="pl-o">&gt;&gt;</span><span class="pl-mi">1</span><span class="pl-p">;</span>
    <span class="pl-n">down</span><span class="pl-p">(</span><span class="pl-n">root</span><span class="pl-p">,</span><span class="pl-n">l</span><span class="pl-p">,</span><span class="pl-n">r</span><span class="pl-p">);</span>
    <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">s</span><span class="pl-o">&lt;=</span><span class="pl-n">mid</span><span class="pl-p">)</span><span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-n">root</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">l</span><span class="pl-p">,</span><span class="pl-n">mid</span><span class="pl-p">,</span><span class="pl-n">s</span><span class="pl-p">,</span><span class="pl-n">t</span><span class="pl-p">,</span><span class="pl-n">w</span><span class="pl-p">);</span>
    <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">t</span><span class="pl-o">&gt;</span><span class="pl-n">mid</span><span class="pl-p">)</span><span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-n">root</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-o">|</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">mid</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">r</span><span class="pl-p">,</span><span class="pl-n">s</span><span class="pl-p">,</span><span class="pl-n">t</span><span class="pl-p">,</span><span class="pl-n">w</span><span class="pl-p">);</span>
    <span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">root</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">root</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">root</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-o">|</span><span class="pl-mi">1</span><span class="pl-p">];</span>
<span class="pl-p">}</span>
<span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-nf">query</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">root</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">l</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">r</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">s</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">t</span><span class="pl-p">){</span>
    <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">l</span><span class="pl-o">&gt;</span><span class="pl-n">r</span><span class="pl-p">)</span><span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-k">else</span> <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">l</span><span class="pl-o">==</span><span class="pl-n">r</span><span class="pl-p">)</span><span class="pl-k">return</span> <span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">root</span><span class="pl-p">];</span>
    <span class="pl-kt">int</span> <span class="pl-n">mid</span><span class="pl-o">=</span><span class="pl-p">(</span><span class="pl-n">l</span><span class="pl-o">+</span><span class="pl-n">r</span><span class="pl-p">)</span><span class="pl-o">&gt;&gt;</span><span class="pl-mi">1</span><span class="pl-p">;</span>
    <span class="pl-n">down</span><span class="pl-p">(</span><span class="pl-n">root</span><span class="pl-p">,</span><span class="pl-n">l</span><span class="pl-p">,</span><span class="pl-n">r</span><span class="pl-p">);</span>
    <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">s</span><span class="pl-o">&lt;=</span><span class="pl-n">l</span> <span class="pl-o">&amp;&amp;</span> <span class="pl-n">t</span><span class="pl-o">&gt;=</span><span class="pl-n">r</span><span class="pl-p">)</span><span class="pl-k">return</span> <span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">root</span><span class="pl-p">];</span>
    <span class="pl-k">else</span> <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">t</span><span class="pl-o">&lt;=</span><span class="pl-n">mid</span><span class="pl-p">)</span><span class="pl-k">return</span> <span class="pl-n">query</span><span class="pl-p">(</span><span class="pl-n">root</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">l</span><span class="pl-p">,</span><span class="pl-n">mid</span><span class="pl-p">,</span><span class="pl-n">s</span><span class="pl-p">,</span><span class="pl-n">t</span><span class="pl-p">);</span>
    <span class="pl-k">else</span> <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">s</span><span class="pl-o">&gt;</span><span class="pl-n">mid</span><span class="pl-p">)</span><span class="pl-k">return</span> <span class="pl-n">query</span><span class="pl-p">(</span><span class="pl-n">root</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-o">|</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">mid</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">r</span><span class="pl-p">,</span><span class="pl-n">s</span><span class="pl-p">,</span><span class="pl-n">t</span><span class="pl-p">);</span>
    <span class="pl-k">else</span> <span class="pl-k">return</span> <span class="pl-n">query</span><span class="pl-p">(</span><span class="pl-n">root</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">l</span><span class="pl-p">,</span><span class="pl-n">mid</span><span class="pl-p">,</span><span class="pl-n">s</span><span class="pl-p">,</span><span class="pl-n">t</span><span class="pl-p">)</span><span class="pl-o">+</span><span class="pl-n">query</span><span class="pl-p">(</span><span class="pl-n">root</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-o">|</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">mid</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">r</span><span class="pl-p">,</span><span class="pl-n">s</span><span class="pl-p">,</span><span class="pl-n">t</span><span class="pl-p">);</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
    <span class="pl-kt">char</span> <span class="pl-n">o</span><span class="pl-p">[</span><span class="pl-mi">10</span><span class="pl-p">];</span>
    <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">);</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span><span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%lld&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
    <span class="pl-n">build</span><span class="pl-p">(</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">n</span><span class="pl-p">);</span>
    <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">m</span><span class="pl-p">);</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">m</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
        <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%s&quot;</span><span class="pl-p">,</span><span class="pl-n">o</span><span class="pl-p">);</span>
        <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">o</span><span class="pl-p">[</span><span class="pl-mi">0</span><span class="pl-p">]</span><span class="pl-o">==</span><span class="pl-sc">&#39;A&#39;</span><span class="pl-p">){</span>
            <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%d%lld&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">a</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">b</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">c</span><span class="pl-p">);</span>
            <span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">a</span><span class="pl-p">,</span><span class="pl-n">b</span><span class="pl-p">,</span><span class="pl-n">c</span><span class="pl-p">);</span>
        <span class="pl-p">}</span>
        <span class="pl-k">else</span><span class="pl-p">{</span>
            <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">a</span><span class="pl-p">);</span>
            <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%lld</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span><span class="pl-n">query</span><span class="pl-p">(</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">a</span><span class="pl-p">,</span><span class="pl-n">a</span><span class="pl-p">));</span>
        <span class="pl-p">}</span>
    <span class="pl-p">}</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>